On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}

نویسندگان

  • Egon Balas
  • Shu Ming Ng
چکیده

In an earlier paper [I1 we characterized the class of facets of the set covering polytope defined by inequalities with coefficients equal to 0, 1 or S2. -iT this paper we connects/that characterization to the theory of facet lifting. In particular, we-introduc~ a family of lower dimensional polytopes and associated inequalities having only three nonzero coefficients, whose lifting yields all the valid inequalities in the above class, with the lifting coefficients given by closed form expressions. Accession For "" " DTIC TAB __ _ _ _ _ __ _ _ _ _ Ic Aysilabl1t Codes ,J'-' A " a ."5.and/or Dist Special

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Facets of the Complementarity Knapsack Polytope

We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additional constraints, and the model is tightened by introducing strong inequalities valid for the resulting MIP. We use an alternative approach, in which we keep in the model only the continuous variables, and we tighten th...

متن کامل

Forthcoming in Discrete Optimization SUPERMODULAR COVERING KNAPSACK POLYTOPE

The supermodular covering knapsack set is the discrete upper level set of a non-decreasing supermodular function. Submodular and supermodular knapsack sets arise naturally when modeling utilities, risk and probabilistic constraints on discrete variables. In a recent paper Atamtürk and Narayanan [6] study the lower level set of a non-decreasing submodular function. In this complementary paper we...

متن کامل

Supermodular covering knapsack polytope

The supermodular covering knapsack set is the discrete upper level set of a non-decreasing supermodular function. Submodular and supermodular knapsack sets arise naturally when modeling utilities, risk and probabilistic constraints on discrete variables. In a recent paper Atamtürk and Narayanan [6] study the lower level set of a non-decreasing submodular function. In this complementary paper we...

متن کامل

The Rank Facets of the Stable Set Polytope for Claw-Free Graphs

This paper provides a complete characterization of all the rank facets of the stable set polytope STAB(G) associated with a claw-free graph G. In particular, it is shown that a claw-free graph G produces a rank facet of STAB(G) if and only if it can be obtained by means of two simple lifting procedures from three basic classes of graphs: (i) cliques, (ii) line graphs of minimal 2-connected hypo...

متن کامل

New facets for the planar subgraph polytope

This paper describes certain facet classes for the planar subgraph polytope. These facets are extensions of Kuratowski facets and are of the form 2x(U)+x(E(G)\U) ≤ 2|U |+|E(G)\U | −2 where the edge set U varies and can be empty. Two of the new types of facets complete the class of extended subdivision facets, explored by Jünger and Mutzel. In addition, the other types of facets consist of a new...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Program.

دوره 45  شماره 

صفحات  -

تاریخ انتشار 1989